Continuous semantics for strong normalisation

نویسنده

Ulrich Berger

چکیده

We prove a general strong normalisation theorem for higher type rewrite systems based on Tait's strong computability predicates and a strictly continuous domain-theoretic semantics. The theorem applies to extensions of Gödel's system T , but also to various forms of barrecursion for which strong normalisation was hitherto unknown.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Compositional Characterisations of λ-terms using Intersection Types ?

We show how to characterise compositionally a number of evaluation properties of λ-terms using Intersection Type assignment systems. In particular, we focus on termination properties, such as strong normalisation, normalisation, head normalisation, and weak head normalisation. We consider also the persistent versions of such notions. By way of example, we consider also another evaluation proper...

متن کامل

Normalisation by evaluation in the compilation of typed functional programming languages

This thesis presents a critical analysis of normalisation by evaluation as a technique for speeding up compilation of typed functional programming languages. Our investigation focuses on the SML.NET compiler and its typed intermediate language MIL. We implement and measure the performance of normalisation by evaluation for MIL across a range of benchmarks. Taking a different approach, we also i...

متن کامل

Semantics with Intersection Types ∗ Steffen

2 Approximation and normalization results 9 2.1 Approximants . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 10 2.2 Approximation result . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 12 2.3 Principal pairs and Semantics . . . . . . . . . . . . . . . . . . . . . . . . . . 14 2.4 Normalization results . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 15...

متن کامل

Strong Normalisation in the π-Cal ulus

We introduce a typed π-calculus where strong normalisation is ensured by typability. Strong normalisation is a useful property in many computational contexts, including distributed systems. In spite of its simplicity, our type discipline captures a wide class of converging name-passing interactive behaviour. The proof of strong normalisability combines methods from typed λ-calculi and linear lo...

متن کامل